package com.stmt.analytic.graph.algorithm.bc;

import java.util.Map;

public interface GraphInterface<T> {

    void addEdge(String source, String destination);

    void allShtstPaths();//Finds the shortest paths between all possible combinations of binary nodes.

    float getCloseness();   // returns tthe highest closeness value of the graph

    String getClosestSource();  //returns the node has the highest closeness value

    String getBetweennestSource(); //returns the node has the highest betweenness value

    int getBetweenness(); //returns the highest betweenness value of the graph

    Map<String, Float> getAllBetweenness();
}
